منابع مشابه
Least – Squares Method For Estimating Diffusion Coefficient
Abstract: Determination of the diffusion coefficient on the base of solution of a linear inverse problem of the parameter estimation using the Least-square method is presented in this research. For this propose a set of temperature measurements at a single sensor location inside the heat conducting body was considered. The corresponding direct problem was then solved by the application of the ...
متن کاملLEAST – SQUARES METHOD FOR ESTIMATING DIFFUSION COEFFICIENT
Determining the diffusion coefficient based on the solution of the linear inverse problem of the parameter estimation by using the Least-square method is presented. A set of temperature measurements at a single sensor location inside the heat conducting body is required. The corresponding direct problem will be solved by an application of the heat fundamental solution.
متن کاملA meshless discrete Galerkin method for solving the universe evolution differential equations based on the moving least squares approximation
In terms of observational data, there are some problems in the standard Big Bang cosmological model. Inflation era, early accelerated phase of the evolution of the universe, can successfully solve these problems. The inflation epoch can be explained by scalar inflaton field. The evolution of this field is presented by a non-linear differential equation. This equation is considered in FLRW model...
متن کاملUniform approximation by discrete least squares polynomials
We study uniform approximation of differentiable or analytic functions of one or several variables on a compact set K by a sequence of discrete least squares polynomials. In particular, if K satisfies a Markov inequality and we use point evaluations on standard discretization grids with the number of points growing polynomially in the degree, these polynomials provide nearly optimal approximant...
متن کاملDiscrete Least Squares Approximation by Trigonometric Polynomials
We present an efficient and reliable algorithm for discrete least squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2tt) by trigonometric polynomials. The algorithm is based on a scheme for the solution of an inverse eigenproblem for unitary Hessenberg matrices, and requires only O(mn) arithmetic operations as compared with 0(mn ) operations needed for alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1977
ISSN: 0025-5718
DOI: 10.2307/2005780